Robust design of experiments using constrained stochastic optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust design of experiments using constrained stochastic optimization

Process models that are affected by uncertainties need a robust mechanism to account for them in the model based design of experiments (DOE). The aim of this study is to design a set of experiments to estimate the parameters of multiscale kinetic models for the catalytic decomposition of ammonia. Along with uncertainties in the model, the problem is challenging due to constraints on experimenta...

متن کامل

Robust parameter design optimization of simulation experiments using stochastic perturbation methods

Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simulation experiment. The Simultaneous Perturbation Stochastic Approximation (SPSA) method has the advantage over similar methods of requiring only 2 measurements at each iteration of the search. This feature makes SPSA att...

متن کامل

A Robust Knapsack Based Constrained Portfolio Optimization

Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...

متن کامل

Constrained Robust Submodular Optimization

In this paper, we consider the problem of constrained maximization of the minimum of a set of submodular functions, in which the goal is to find solutions that are robust to worst-case values of the objective functions. Unfortunately, this problem is both non-submodular and inapproximable. In the case where the submodular functions are monotone, an approximate solution can be found by relaxing ...

متن کامل

Budgeted Optimization with Constrained Experiments

Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(·) given a budget by requesting a sequence of samples from the function. In our setting, however, evaluating the function at precisely specified points is not practically possible due to prohibitive costs. Instead, we can only request constrained experiments. A c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2015

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2015.08.165